Large Scale Fuzzy pD * Reasoning Using MapReduce
نویسندگان
چکیده
The MapReduce framework has proved to be very efficient for data-intensive tasks. Earlier work has tried to use MapReduce for large scale reasoning for pD∗ semantics and has shown promising results. In this paper, we move a step forward to consider scalable reasoning on top of semantic data under fuzzy pD∗ semantics (i.e., an extension of OWL pD∗ semantics with fuzzy vagueness). To the best of our knowledge, this is the first work to investigate how MapReduce can help to solve the scalability issue of fuzzy OWL reasoning. While most of the optimizations used by the existing MapReduce framework for pD∗ semantics are also applicable for fuzzy pD∗ semantics, unique challenges arise when we handle the fuzzy information. We identify these key challenges, and propose a solution for tackling each of them. Furthermore, we implement a prototype system for the evaluation purpose. The experimental results show that the running time of our system is comparable with that of WebPIE, the state-of-the-art inference engine for scalable reasoning in pD∗ semantics.
منابع مشابه
Scale reasoning with fuzzy-EL ontologies based on MapReduce
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy or vague knowledge. In this paper, we consider the problem of reasoning with fuzzy-EL, which is a fuzzy extension of EL+. We first identify the challenges and present revised completion classification rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for sc...
متن کاملReasoning with Fuzzy-EL+ Ontologies Using MapReduce
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy knowledge. In this paper, we consider fuzzy-EL, which is a fuzzy extension of EL. We first present revised completion rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL ontologies based on MapReduce.
متن کاملLarge Scale Temporal RDFS Reasoning Using MapReduce
In this work, we build a large scale reasoning engine under temporal RDFS semantics using MapReduce. We identify the major challenges of applying MapReduce framework to reason over temporal information, and present our solutions to tackle them.
متن کاملToward Scalable Reasoning over Annotated RDF Data Using MapReduce
The Resource Description Framework (RDF) is one of the major representation standards for the Semantic Web. RDF Schema (RDFS) is used to describe vocabularies used in RDF descriptions. Recently, there is an increasing interest to express additional information on top of RDF data. Several extensions of RDF were proposed in order to deal with time, uncertainty, trust and provenance. All these spe...
متن کاملDistributed Reasoning with EL using MapReduce
It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time [23]. Later work has carried this approach over to OWL Horst [22]. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the descriptio...
متن کامل